Greedy algorithms for max sat and maximum matching: their power and limitations
نویسنده
چکیده
منابع مشابه
On the limitations of deterministic de-randomizations for online bipartite matching and max-sat
The surprising results of Karp, Vazirani and Vazirani [35] and (respectively) Buchbinder et al [15] are examples where rather simple randomization provides provably better approximations than the corresponding deterministic counterparts for online bipartite matching and (respectively) unconstrained non-monotone submodular. We show that seemingly strong extensions of the deterministic online com...
متن کاملGreedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
We give a simple, randomized greedy algorithm for the maximum satisfiability problem (MAX SAT) that obtains a 3 4 -approximation in expectation. In contrast to previously known 3 4 -approximation algorithms, our algorithm does not use flows or linear programming. Hence we provide a positive answer to a question posed by Williamson in 1998 on whether such an algorithm exists. Moreover, we show t...
متن کاملA Parallel GRASP for MAX-SAT Problems
The weighted maximum satis ability MAX SAT problem is central in mathematical logic computing theory and many indus trial applications In this paper we present a parallel greedy randomized adaptive search procedure GRASP for solving MAX SAT problems Experimental results indicate that almost linear speedup is achieved
متن کاملOn randomizing two derandomized greedy algorithms
We consider the performance of two classic approximation algorithms which work by scanning the input and greedily constructing a solution. We investigate whether running these algorithms on a random permutation of the input can increase their performance ratio. We obtain the following results: 1. Johnson’s approximation algorithm for MAX-SAT is one of the first approximation algorithms to be ri...
متن کاملBounds on Greedy Algorithms for MAX SAT
We study adaptive priority algorithms for MAX SAT and show that no such deterministic algorithm can reach approximation ratio 3 4 , assuming an appropriate model of data items. As a consequence we obtain that the Slack–Algorithm of [13] cannot be derandomized. Moreover, we present a significantly simpler version of the Slack–Algorithm and also simplify its analysis. Additionally, we show that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012